Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice

Recently, Augot and Finiasz presented a coding theoretic public key cryptosystem that suggests a new approach for designing such systems based on the Polynomial Reconstruction Problem. Their cryptosystem is an instantiation of this approach under a specific choice of parameters which, given the state of the art of coding theory, we show in this work to be sub-optimal. Coron showed how to attack...

متن کامل

Cryptanalysis of the the Polynomial Reconstruction Based Public-Key Cryptosystem of Eurocrypt’03 in the Optimal Parameter Setting

In Eurocrypt 2003, Augot and Finiasz presented a novel Public-key Cryptosystem based on the Polynomial Reconstruction Problem. While there is no immediate way to use coding theoretic techniques to break their system, it has been subsequently broken by Coron who presented a ciphertext-only attack (based on a worst case analysis). In the present work we study the optimal parameter setting of thei...

متن کامل

Cryptanalysis of the Repaired Public-key Encryption Scheme Based on the Polynomial Reconstruction Problem

At Eurocrypt 2003, Augot and Finiasz proposed a new public-key encryption scheme based on the polynomial reconstruction problem [1]. The scheme was subsequently broken in [5], who showed that given the public-key and a ciphertext, one could recover the corresponding plaintext in polynomial time. Recently, Augot, Finiasz and Loidreau published on the IACR eprint archive a reparation [2] of the c...

متن کامل

A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem

The Polynomial Reconstruction problem (PR) has been introduced in 1999 as a new hard problem. Several cryptographic primitives established on this problem have been constructed, for instance Naor and Pinkas have proposed a protocol for oblivious polynomial evaluation. Then it has been studied from the point of view of robustness, and several important properties have been discovered and proved ...

متن کامل

Cryptanalysis of a Public-Key Encryption Scheme Based on the Polynomial Reconstruction Problem

We describe a cryptanalysis of a public-key encryption scheme based on the polynomial reconstruction problem, published at Eurocrypt 2003 by Augot and Finiasz. Given the public-key and a ciphertext, we recover the corresponding plaintext in polynomial time. Our technique is a variant of the Berlekamp-Welsh algorithm. We also describe a cryptanalysis of the reparation published by the authors on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Designs, Codes and Cryptography

سال: 2007

ISSN: 0925-1022,1573-7586

DOI: 10.1007/s10623-007-9055-8